package com.leetcode.algorithm.y22.m06;


class QuestionLcp06Solution01 {

	public int minCount(int[] coins) {
		int cnt = 0;
		for (int coin : coins) {
			cnt += (coin + 1) / 2;
		}
		return cnt;
	}

}